A fast algorithm for finding a maximal common subsequence of multiple strings

For any m strings of total length n, we propose an O(mn log n)-time, O(n)-space algorithm that finds a maximal common subsequence all the strings, in sense inserting character it no longer yields them. Such could be treated as indicating nontrivial structure find since is NP-hard to longest strings.